On the Synthesis of Strategies in Innnite Games ?
نویسنده
چکیده
Innnite two-person games are a natural framework for the study of reactive nonterminating programs. The eeective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of innnite games (given by \game graphs"), outline a new construction of winning strategies in nite-state games, and formulate some questions which arise for games over eeectively presented innnite graphs.
منابع مشابه
Nash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملDomination Games on In nite Graphs
We consider two innnite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way innnite path) in G, so that the ray's labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, provid...
متن کاملParallel strategies
We consider some combinatorial principles based on playing in parallel several two person games. For innnite games, the determinacy of the games implies these principles, but we show that they can fail for nondetermined games. We pose a question, if these principles, stated for nite games, are provable in weak axiomatic systems for arithmetic (bounded arithmetic).
متن کاملThe Complexity of Learning Branches and Strategies from Queries
The problems of learning strategies for closed innnite games (as a model for learning process controllers) and of learning innnite branches of computable trees have been introduced in inductive inference. We study the complexity of these problems in a query learning model for closed games and trees represented by deterministic nite automata. We show that already for nite-state trees, which are ...
متن کاملEffective Strategies for Enumeration Games
We study the existence of eeective winning strategies in certain innnite games, so called enumeration games. Originally, these were introduced by Lachlan (1970) in his study of the lattice of recursively enumerable sets. We argue that they provide a general and interesting framework for computable games and may also be well suited for modelling reactive systems. Our results are obtained by redu...
متن کامل